Coloring ($P_5$, bull)-free graphs
نویسنده
چکیده
We give a polynomial-time algorithm that computes the chromatic number of any graph that contains no path on five vertices and no bull as an induced subgraph (where the bull is the graph with five vertices a, b, c, d, e and edges ab, bc, cd, be, ce).
منابع مشابه
Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs
We consider the Seidel complementation on ($P_5, \bar{P_5}, Bull)$-free graphs
متن کاملThe coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
We show that determining the chromatic number of a {P 5 , P 5 }-free graph or a {P 5 , K p − e}-free graph can be done in polynomial time.
متن کاملOn $(P_5,\bar{P_5})$-sparse graphs and other families
We extend the notion of $P_4$-sparse graphs previously introduced by {\scshape Ho\`ang} by considering $\mathcal{F}$-sparse graphs were $\mathcal{F}$ denotes a finite set of graphs on $p$ vertices. Thus we obtain some results on $(P_5,\bar{P_5})$-sparse graphs already known on $(P_5,\bar{P_5})$-free graphs. Finally we completely describe the structure of $(P_5,\bar{P_5}, bull$)-sparse graphs, i...
متن کاملPolynomial-time algorithm for vertex k-colorability of P_5-free graphs
We give the first polynomial-time algorithm for coloring vertices of P5free graphs with k colors. This settles an open problem and generalizes several previously known results. Page 2 RRR 2006 21
متن کاملOn colouring (2P2, H)-free and (P5, H)-free graphs
The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no induced subgraph isomorphic to $H_1$ or $H_2$. A connected graph $H_1$ is almost classified if Colouring on $(H_1,H_2)$-free graphs is known to be polynomial-time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.08918 شماره
صفحات -
تاریخ انتشار 2017